翻訳と辞書
Words near each other
・ Disjecta
・ Disjecta (Beckett)
・ Disjecta membra
・ Disjoining pressure
・ Disjoint
・ Disjoint sets
・ Disjoint union
・ Disjoint union (topology)
・ Disjoint-set data structure
・ Disjointed Parallels
・ Disjunct
・ Disjunct (linguistics)
・ Disjunct distribution
・ Disjunct matrix
・ Disjunction and existence properties
Disjunction elimination
・ Disjunction introduction
・ Disjunction property of Wallman
・ Disjunctive
・ Disjunctive cognition
・ Disjunctive graph
・ Disjunctive normal form
・ Disjunctive population
・ Disjunctive pronoun
・ Disjunctive sequence
・ Disjunctive sum
・ Disjunctive syllogism
・ Disjunctivism
・ Disk (mathematics)
・ Disk 413


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Disjunction elimination : ウィキペディア英語版
Disjunction elimination

In propositional logic, disjunction elimination〔https://proofwiki.org/wiki/Rule_of_Or-Elimination〕〔http://www.cs.gsu.edu/~cscskp/Automata/proofs/node6.html〕 (sometimes named proof by cases, case analysis, or or elimination), is the valid argument form and rule of inference that allows one to eliminate a disjunctive statement from a logical proof. It is the inference that if a statement P implies a statement Q and a statement R also implies Q, then if either P or R is true, then Q has to be true. The reasoning is simple: since at least one of the statements P and R is true, and since either of them would be sufficient to entail Q, Q is certainly true.
:If I'm inside, I have my wallet on me.
:If I'm outside, I have my wallet on me.
:It is true that either I'm inside or I'm outside.
:Therefore, I have my wallet on me.
It is the rule can be stated as:
:\frac
where the rule is that whenever instances of "P \to Q", and "R \to Q" and "P \or R" appear on lines of a proof, "Q" can be placed on a subsequent line.
== Formal notation ==
The ''disjunction elimination'' rule may be written in sequent notation:
: (P \to Q), (R \to Q), (P \or R) \vdash Q
where \vdash is a metalogical symbol meaning that Q is a syntactic consequence of P \to Q, and R \to Q and P \or R in some logical system;
and expressed as a truth-functional tautology or theorem of propositional logic:
:(((P \to Q) \and (R \to Q)) \and (P \or R)) \to Q
where P, Q, and R are propositions expressed in some formal system.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Disjunction elimination」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.